Height of minor faces in plane normal maps
نویسندگان
چکیده
منابع مشابه
Describing 3-paths in normal plane maps
We prove that every normal plane map, as well as every 3polytope, has a path on three vertices whose degrees are bounded from above by one of the following triplets: $(3,3,\infty)$, $(3,4,11)$, $(3,7,6)$, $(3,10,4)$, $(3,15,3)$, $(4,4,9)$, $(6,4,8)$, $(7,4,7)$, and $(6,5,6)$. No parameter of this description can be improved, as shown by appropriate 3-polytopes. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ...
متن کاملC*-Extreme Points and C*-Faces oF the Epigraph iF C*-Affine Maps in *-Rings
Abstract. In this paper, we define the notion of C*-affine maps in the unital *-rings and we investigate the C*-extreme points of the graph and epigraph of such maps. We show that for a C*-convex map f on a unital *-ring R satisfying the positive square root axiom with an additional condition, the graph of f is a C*-face of the epigraph of f. Moreover, we prove som...
متن کاملOn the structural result on normal plane maps
We prove the structural result on normal plane maps, which applies to the vertex distance colouring of plane maps. The vertex distance-t chromatic number of a plane graph G with maximum degree ∆(G) ≤ D, D ≥ 12 is proved to be upper bounded by 6+ 2D+12 D−2 ((D−1)(t−1)−1). This improves a recent bound 6 + 3D+3 D−2 ((D − 1)t−1 − 1), D ≥ 8 by Jendrol’ and Skupień, and the upper bound for distance-2...
متن کاملRainbow faces in edge-colored plane graphs
A face of an edge colored plane graph is called rainbow if all its edges receive distinct colors. The maximum number of colors used in an edge coloring of a connected plane graph G with no rainbow face is called the edge-rainbowness of G. In this paper we prove that the edge-rainbowness of G equals to the maximum number of edges of a connected bridge face factor H of G, where a bridge face fact...
متن کاملForcing faces in plane bipartite graphs
Let denote the class of connected plane bipartite graphs with no pendant edges. A finite face s of a graphG ∈ is said to be a forcing face ofG if the subgraph ofG obtained by deleting all vertices of s together with their incident edges has exactly one perfect matching. This is a natural generalization of the concept of forcing hexagons in a hexagonal system introduced in Che and Chen [Forcing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00292-5